. Efficient Parallel Algorithms on Distance-Hereditary Graphs
نویسندگان
چکیده
In this papel; we present eficient parallel algorithms forjinding a minimum weighted connected dominating set, a minimum weighted Steiner tree for a distance-hereditary graph which take O(1og n) time using O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of a given graph, respectively. We also find a maximum weighted clique of a distance-hereditary graph in O(log2 n) time using O(n + m) processors on a CREW PRAM.
منابع مشابه
Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs
A parallel algorithm to recognize cographs with a linear processor bound and a log’ II time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (199 I ). As a consequence distance hereditary graphs can be recognized by the same processor and time bound.
متن کاملGraph Classes between Parity and Distance-Hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs, are NP-complete or open for parity graphs. Moreover, the metric characterizations of these two graph classes suggest an excessive gap between them. We introduce a family of classes forming an infinite lattice with re...
متن کاملLinear-time algorithms for the Hamiltonian problems on distance-hereditary graphs,
In the literature, there are quite a few algorithms to solve problems on distance-hereditary graphs. Two well-known graphs, trees and cographs, both belong to the class of distance-hereditary graphs. In this paper, we present an O(|V | + |E|)-time sequential algorithm to solve the Hamiltonian problem on a distance-hereditary graph G = (V, E). This algorithm is faster than the previous best resu...
متن کاملParallel Recognition and Location Algorithms for Chordal Graphs Using Distance Matrices
We present efficient parallel algorithms for recognizing chordal graphs and locating all maximal cliques of a chordal graph G=(V,E). Our techniques are based on partitioning the vertex set V using information contained in the distance matrix of the graph. We use these properties to formulate parallel algorithms which, given a graph G=(V,E) and its adjacency-level sets, decide whether or not G i...
متن کاملAlgorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
متن کامل